On-line vertex-covering
نویسندگان
چکیده
منابع مشابه
On-Line Machine Covering
We consider the problem of scheduling a sequence of jobs to m parallel machines as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all the machines are alive, and the system should be maintained alive as long as possible. It is well known that any on-line deterministic algori...
متن کاملCapacitated vertex covering
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V ,E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we pay the weight of the vertex and cover up to a pre-specified number of edges incident on this ver...
متن کاملOn-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item sizes. For every finite set of bins B, and upper bound 1/m on the size of items for some integer m, we define a ratio r(B, m). We prove this is the best possible competitive ratio for the set of bins B and the paramete...
متن کاملFurther Results on Vertex Covering of Powers of Complete Graphs
A snake in a graph G is defined to be a closed path in G without proper chords. Let Kd n be the product of d copies of the complete graph Kn. Wojciechowski [13] proved that for any d ≥ 2 the hypercube Kd 2 can be vertex covered with at most 16 disjoint snakes. Alsardary [6] proved that for any odd integer n ≥ 3,d ≥ 2 the graph Kd n can be vertex covered with 2n 3 snakes. We show that for any ev...
متن کاملA Memory-Efficient Algorithm for Vertex Covering on Huge Graphs
C1. The input graph cannot be modified; its integrity must be preserved. C2. The processing unit has a “small” memory space (compared to the huge size of the graph). C3. The solution must be sent piece by piece to an external memory as soon as it is produced. Constraint C2 implies that the graph cannot be loaded into the memory of the processing unit. The constraint C3 comes from the fact that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.08.015